Cut for Core Logic

نویسنده

  • Neil Tennant
چکیده

The motivation for Core Logic is explained. Its system of proof is set out. It is then shown that, although the system has no Cut rule, its relation of deducibility obeys Cut with epistemic gain. §1. The debate over logical reform. There is much dispute over which logic is the right logic—indeed, over whether there could even be such a thing as the right logic, rather than a spectrum of logics variously suited for different applications in different areas. Absolutists about logic regard the use of the definite article as justified; pluralists have their principled doubts. For those who engage in the absolutist debate, those whom we can call the quietists are willing to accept the full canon C of classical logic. Their opponents, whom we can call the reformists—intuitionists and relevantists prominent among them— argue that certain rules of classical logic lack validity, and have no right to be in the canon. Intuitionists, on the one hand, originally drew inspiration for their critique of classical logic from the requirements of constructivity in mathematical proof. According to the intuitionist’s construal of existence, a mathematical existence claim of the form ‘there is a natural number n such that F(n)’ requires its asserter to be able to provide a justifying instance—a constructively determinable number t for which one can prove (intuitionistically!) that F(t):

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Rule-Irredundancy and the Sequent Calculus for Core Logic

We explore the consequences, for logical system-building, of taking seriously (i) the aim of having irredundant rules of inference, and (ii) a preference for proofs of stronger results over proofs of weaker ones. This leads one to re-consider the structural rules of Reflexivity, Thinning and Cut. Reflexivity survives in the minimally necessary form φ : φ. Proofs have to get started. Cut is subj...

متن کامل

Cut for Classical Core Logic

In an earlier paper in this journal I provided detailed motivation for the constructive and relevant system of Core Logic; explained its main features; and established that, even though Cut is not a rule of the system, nevertheless Cut is admissible for it, and indeed with potential epistemic gain. If Π is a proof of the sequent ∆ : A, and Σ is a proof of the sequent Γ, A : θ, then there is a c...

متن کامل

CERES in higher-order logic

We define a generalization CERES of the first-order cut-elimination method CERES to higher-order logic. At the core of CERES lies the computation of an (unsatisfiable) set of sequents CS(π) (the characteristic sequent set) from a proof π of a sequent S. A refutation of CS(π) in a higher-order resolution calculus can be used to transform cut-free parts of π (the proof projections) into a cut-fre...

متن کامل

A First Order System with Finite Choice of Premises

We call finitely generating an inference rule in a sequent system [7] if, given its conclusion, there is only a finite set of premises to choose from. This property is desirable from the viewpoint of proof search, since it implies that the search tree is finitely branching. It is also desirable for showing consistency, since the biggest obstacle to showing consistency is the cut rule, which is ...

متن کامل

Opus: University of Bath Online Publication Store a Logic of Sequentiality

Game semantics has been used to interpret both proofs and functional programs: an important further development on the programming side has been to model higher-order programs with state by allowing strategies with “history-sensitive” behaviour. In this paper, we develop a detailed analysis of the structure of these strategies from a logical perspective by showing that they correspond to proofs...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Rew. Symb. Logic

دوره 5  شماره 

صفحات  -

تاریخ انتشار 2012